منابع مشابه
Towards the Albertson Conjecture
Albertson conjectured that if a graph G has chromatic number r, then the crossing number of G is at least as large as the crossing number of Kr, the complete graph on r vertices. Albertson, Cranston, and Fox verified the conjecture for r 6 12. In this paper we prove it for r 6 16. Dedicated to the memory of Michael O. Albertson.
متن کاملOn the Distinguishing Number of Cyclic Tournaments: Towards Albertson-Collins Conjecture
A distinguishing r-labeling of a digraph G is a mapping λ from the set of vertices of G to the set of labels {1, . . . , r} such that no nontrivial automorphism of G preserves all the labels. The distinguishing number D(G) of G is then the smallest r for which G admits a distinguishing r-labeling. From a result of Gluck (David Gluck, Trivial set-stabilizers in finite permutation groups, Can. J....
متن کاملTowards the Willmore conjecture
We develop a variety of approaches, mainly using integral geometry, to proving that the integral of the square of the mean curvature of a torus immersed in R3 must always take a value no less than 2π2. Our partial results, phrased mainly within the S3-formulation of the problem, are typically strongest when the Gauss curvature can be controlled in terms of extrinsic curvatures or when the torus...
متن کاملTowards testing the Maldacena Conjecture with SDLCQ
We consider the Maldacena conjecture applied to the near horizon geometry of a D1-brane in the supergravity approximation and present numerical results of a test of the conjecture against the boundary field theory calculation using supersymmetric discrete light-cone quantization (SDLCQ). We present numerical results with approximately 1000 times as many states as we previously considered. These...
متن کاملTowards the Graceful Tree Conjecture: A Survey
A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2, . . . , n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference between the two end-vertex labels. The Graceful Tree Conjecture states that all trees have a graceful labelling. In this survey we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2010
ISSN: 1077-8926
DOI: 10.37236/345